Minimization of Parity-Checked Fault-Secure AND/EXOR Networks
نویسندگان
چکیده
We present a new algorithm for the eecient realization of fault-secure and totally self-checking circuits for multi-output boolean functions using parity-checked AND/EXOR networks. First results on the minimization of a large set of typical arithmetic and random functions and several MCNC benchmark circuits show that AND/EXOR networks often allow much better solutions than traditional AND/OR networks. The overhead for the realization of the parity output may be as low as a few percent.
منابع مشابه
A New Equivalence Relation of Logic Functions and Its Application in the Design of AND-OR-EXOR Networks
This paper presents a design method for AND-OR-EXOR three-level networks, where a single two-input exclusive-OR (EXOR) gate is used. The network realizes an EXOR of two sum-of-products expressions (EX-SOPs). The problem is to minimize the total number of products in the two sum-of-products expressions (SOPs). We introduce the notion of μ-equivalence of logic functions to develop exact minimizat...
متن کاملSynthesis of SPP three-level logic networks using affine spaces
Recently defined, three-level logic sum of pseudoproducts (SPP) forms are EXOR-AND-OR networks representing Boolean functions, and are much shorter than standard two-level sum of products (SOP) expressions (Luccio and Pagli, 1999). The main disadvantages of SPP networks are their cumbersome theory in the original formulation and their high minimization time. In addition, the current technology ...
متن کاملAn optimization of AND-OR-EXOR three-level networks
| In this paper, we present a design method for AND-OR-EXOR three-level networks, where a single two-input EXOR gate is used. The network realizes an exclusive-OR of two sum-of-products expressions (EX-SOP), where the two sum-of-products expressions (SOP) cannot share products. The problem is to minimize the total number of product in the two SOPs. We introduced the -equivalence of logic functi...
متن کاملEasily Testable Realization Based on Single-Rail-Input OR-AND-EXOR Expressions
It is known that AND-EXOR two-level networks obtained by AND-EXOR expressions with positive literals are easily testable. They are based on the single-rail-input logic, and require (n + 4) tests to detect their single stuck-at faults, where n is the number of the input variables. We present three-level networks obtained from single-rail-input OR-ANDEXOR expressions and propose a more easily tes...
متن کاملPseudo Kronecker Expressions for Symmetric Functions
ÐPseudo-Kronecker Expressions (PSDKROs) are a class of AND/ EXOR expressions. In this paper, it is proven that exact minimization of PSDKROs for totally symmetric functions can be performed in polynomial time. A new implementation method for PSDKROs is presented. Experimental results are given to show the efficiency of the presented approach in comparison to previously published work on AND/EXO...
متن کامل